home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Monster Media 1996 #15
/
Monster Media Number 15 (Monster Media)(July 1996).ISO
/
bbs_util
/
bsrc_260.zip
/
SRC.ZIP
/
B_PASSWO.C
< prev
next >
Wrap
C/C++ Source or Header
|
1996-02-20
|
6KB
|
159 lines
/*--------------------------------------------------------------------------*/
/* */
/* */
/* ------------ Bit-Bucket Software, Co. */
/* \ 10001101 / Writers and Distributors of */
/* \ 011110 / Freely Available<tm> Software. */
/* \ 1011 / */
/* ------ */
/* */
/* (C) Copyright 1987-96, Bit Bucket Software Co. */
/* */
/* */
/* */
/* BinkleyTerm Password Processor */
/* */
/* */
/* For complete details of the licensing restrictions, please refer */
/* to the License agreement, which is published in its entirety in */
/* the MAKEFILE and BT.C, and also contained in the file LICENSE.260. */
/* */
/* USE OF THIS FILE IS SUBJECT TO THE RESTRICTIONS CONTAINED IN THE */
/* BINKLEYTERM LICENSING AGREEMENT. IF YOU DO NOT FIND THE TEXT OF */
/* THIS AGREEMENT IN ANY OF THE AFOREMENTIONED FILES, OR IF YOU DO */
/* NOT HAVE THESE FILES, YOU SHOULD IMMEDIATELY CONTACT BIT BUCKET */
/* SOFTWARE CO. AT ONE OF THE ADDRESSES LISTED BELOW. IN NO EVENT */
/* SHOULD YOU PROCEED TO USE THIS FILE WITHOUT HAVING ACCEPTED THE */
/* TERMS OF THE BINKLEYTERM LICENSING AGREEMENT, OR SUCH OTHER */
/* AGREEMENT AS YOU ARE ABLE TO REACH WITH BIT BUCKET SOFTWARE, CO. */
/* */
/* */
/* You can contact Bit Bucket Software Co. at any one of the following */
/* addresses: */
/* */
/* Bit Bucket Software Co. FidoNet 1:104/501, 1:343/491 */
/* P.O. Box 460398 AlterNet 7:42/1491 */
/* Aurora, CO 80046 BBS-Net 86:2030/1 */
/* Internet f491.n343.z1.fidonet.org */
/* */
/* Please feel free to contact us at any time to share your comments about */
/* our software and/or licensing policies. */
/* */
/* */
/* This module is based largely on a similar module in OPUS-CBCS V1.03b. */
/* The original work is (C) Copyright 1987, Wynn Wagner III. The original */
/* author has graciously allowed us to use his code in this work. */
/* */
/*--------------------------------------------------------------------------*/
/* Include this file before any other includes or defines! */
#include "includes.h"
char *strnpbk (char *, int);
/*--------------------------------------------------------------------------*/
/* N PASSWORD */
/*--------------------------------------------------------------------------*/
int
n_password (char *theirs, char *ours, int *logit)
{
int got_one;
char s_ours[9], s_theirs[9];
if ((ours != NULL) && (ours[0]))
{
got_one = 2;
if ((theirs != NULL) && (theirs[0]))
{
got_one = 1;
(void) strnpbk (theirs, 8); /* Get rid of trailing blanks */
(void) strnpbk (ours, 8);
if (!strnicmp (theirs, ours, 8))
{
/* If this is the first time, we'll log it.
* Otherwise, forget it.
*/
if (*logit)
{
status_line (MSG_TXT (M_PROTECTED_SESSION));
*logit = FALSE;
}
return 0;
}
}
(void) strncpy (s_ours, ours, 8);
(void) strncpy (s_theirs, theirs, 8);
s_ours[8] = s_theirs[8] = '\0';
status_line (MSG_TXT (M_PWD_ERROR),
Full_Addr_Str (&remote_addr),
theirs,
ours
);
return got_one;
}
return 0;
}
/*--------------------------------------------------------------------------*/
/* N GET PASSWORD */
/* Find the nodelist entry for this system and point remote_password at */
/* its password if any */
/*--------------------------------------------------------------------------*/
int
n_getpassword (ADDRP pw_addr)
{
int i;
remote_password = NULL; /* Default to no password */
newnodedes.Password[0] = '\0';
i = nodefind (pw_addr, 0); /* find the node in the list*/
if (i <= 0)
{
remote_password = NULL;
return (i); /* return failure if can't */
}
if (newnodedes.Password[0] != '\0') /* If anything there, */
{
remote_password = (char *) (&newnodedes.Password[0]);/* Point at it */
return (1); /* Successful attempt */
}
else
{
/* No password involved */
return (0);
}
}
/*
* Strip all trailing blanks from a record.
*
*/
char *
strnpbk (register char *string, register int n)
{
string += n; /* point past end of string */
while (n--) /* now keep count */
{
if (*--string) /* if there's a character */
{
if (*string != ' ') /* if not a blank, we exit */
break;
*string = '\0'; /* if blank, terminate here */
}
}
return string;
}